Large roommate problem with non-transferable random utility

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large roommate problem with non-transferable random utility

We analyze a large roommate problem (i.e., marriage matching in which the marriage is not restricted solely to matchings between men and women) with non-transferable utility. It is well known that while a roommate problem may not have a stable proper matching, each roommate problem does have an stable improper matching. In a random utility model with types from Dagsvik (2000) and Menzel (2015),...

متن کامل

The procedural value for cooperative games with non-transferable utility

I adapt Raiffa's discrete bargaining solution in order to take the possibility of partial cooperation into account when there are more than two players. The approach is non-cooperative. I slightly modify the bargaining procedure proposed by Sjöström for supporting the Raiffa solution, exactly as Hart and MasColell introduced the possibility of partial cooperation in (a slight variation of) the ...

متن کامل

Convex and exact games with non-transferable utility

We generalize exactness to games with non-transferable utility (NTU). In an exact game for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We study five generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be unifi...

متن کامل

Disclosure of information in matching markets with non-transferable utility

We present a model of two-sided matching where utility is non-transferable and information about individuals’ skills is private, utilities are strictly increasing in the partner’s skill and satisfy increasing differences. Skills can be either revealed or kept hidden, but while agents on one side have verifiable skills, agents on the other side have skills that are unverifiable unless certified,...

متن کامل

Stable partitions for games with non-transferable utility and externalities

We provide a model of coalitional bargaining with claims in order to solve games with non-transferable utilities and externalities. We show that, for each such game, payoff configurations exist which will not be renegotiated. In the ordinal game derived from these payoff configurations, we can find a partition in which no group of players has an incentive to jointly change their coalitions. For...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economic Theory

سال: 2017

ISSN: 0022-0531

DOI: 10.1016/j.jet.2016.12.012